package test2;


import demotest.Quque;

import java.util.ArrayList;
import java.util.List;
class quenode{
    public quenode next;
    public quenode last;
    int val;
    public int size;
    public quenode front;
    public quenode rear;
    public quenode(int val){
        this.val = val;
    }
    //入队列
    public boolean enQueue(int val)
    {
        if(!isFull())
        {
            quenode node = new quenode(val);
            rear = node;
            rear.last = rear;
            front = rear;
            return true;
        }
        return false;
    }

    //出队列
    public boolean deQueue(int val)
    {
        if(!isEmpty())
        {

            return true;
        }
        return false;
    }

    //队头元素
    public int front()
    {
        if
    }

    //队尾元素
    public int rear(){

    }

    //判断队列是否为空
    public boolean isFull()
    {

    }

    //判断队列是否为满
    public boolean isEmpty()
    {

    }
}
//设计循环队列
public class MycircularQueue {




}
